Asymptotically optimal algorithms for geometric Max TSP and Max m-PSP
نویسندگان
چکیده
منابع مشابه
Improved deterministic approximation algorithms for Max TSP
We present an O(n)-time approximation algorithm for the maximum traveling salesman problem whose approximation ratio is asymptotically 61 81 , where n is the number of vertices in the input complete edge-weighted (undirected) graph. We also present an O(n)-time approximation algorithm for the metric case of the problem whose approximation ratio is asymptotically 17 20 . Both algorithms improve ...
متن کاملImproved Approximation Algorithms for Metric Max TSP
We present two polynomial-time approximation algorithms for the metric case of the maximum traveling salesman problem. One of them is for directed graphs and its approximation ratio is 27 35 . The other is for undirected graphs and its approximation ratio is 78−o(1). Both algorithms improve on the previous bests.
متن کاملDeterministic algorithms for multi-criteria Max-TSP
We present deterministic approximation algorithms for the multi-criteria maximum traveling salesman problem (Max-TSP). Our algorithms are faster and simpler than the existing randomized algorithms. We devise algorithms for the symmetric and asymmetric multi-criteria Max-TSP that achieve ratios of 1/2k−ε and 1/(4k−2)−ε, respectively, where k is the number of objective functions. For two objectiv...
متن کاملBetter approximations for max TSP
We combine two known polynomial time approximation algorithms for the maximum traveling salesman problem to obtain a randomized algorithm which outputs a solution with expected value of at least r times the optimal one for any given r < 25/33. 2000 Elsevier Science B.V. All rights reserved.
متن کاملApproximating Multi-criteria Max-TSP
The traveling salesman problem (TSP) is one of the most fundamental problems in combinatorial optimization. Given a graph, the goal is to find a Hamiltonian cycle of minimum or maximum weight. We consider finding Hamiltonian cycles of maximum weight (Max-TSP). An instance of Max-TSP is a complete graph G = (V,E) with edge weights w : E → N. The goal is to find a Hamiltonian cycle of maximum wei...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2014
ISSN: 0166-218X
DOI: 10.1016/j.dam.2012.09.007